Stochastic Triad Topology Based Particle Swarm Optimization for Global Numerical Optimization

نویسندگان

چکیده

Particle swarm optimization (PSO) has exhibited well-known feasibility in problem optimization. However, its performance still encounters challenges when confronted with complicated problems many local areas. In PSO, the interaction among particles and utilization of communication information play crucial roles improving learning effectiveness diversity particles. To promote particles, this paper proposes a stochastic triad topology to allow each particle communicate two random ones via their personal best positions. Then, unlike existing studies that employ positions updated neighboring position direct update, adopts one mean three associated as guiding exemplars update particle. further an archive is maintained store obsolete then used interact topology. enhance chance escaping from regions, restart strategy probabilistically triggered introduce initialized solutions archive. alleviate sensitivity parameters, dynamic adjustment strategies are designed dynamically adjust parameter settings during evolution. Integrating above mechanism, topology-based PSO (STTPSO) developed effectively search complex solution space. With techniques, largely promoted thus STTPSO expected explore exploit space appropriately find high-quality solutions. Extensive experiments conducted on commonly CEC 2017 benchmark set different dimension sizes substantiate proposed achieves highly competitive or even much better than state-of-the-art representative variants.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Taguchi-Particle Swarm Optimization for Numerical Optimization

In this work, a hybrid Taguchi-Particle Swarm Optimization (TPSO) is proposed to solve global numerical optimization problems with continuous and discrete variables. This hybrid algorithm combines the well-known Particle Swarm Optimization Algorithm with the established Taguchi method, which has been an important tool for robust design. This paper presents the improvements obtained despite the ...

متن کامل

Constricted Particle Swarm Optimization based Algorithm for Global Optimization

Particle Swarm Optimization (PSO) is a bioinspired meta-heuristic for solving complex global optimization problems. In standard PSO, the particle swarm frequently gets attracted by suboptimal solutions, causing premature convergence of the algorithm and swarm stagnation. Once the particles have been attracted to a local optimum, they continue the search process within a minuscule region of the ...

متن کامل

Particle Swarm, Optimization technique for stochastic

S. P. Umayal* and N. Kamaraj** *Department of Electrical and Electronic Engg., Sethu Institute of Technology, Virudhunagar **Department of Electrical and Electronic Engg., Thiagarajar College of Engineering, Madurai Tamil Nadu 626 106, India Email: [email protected] (Received on 7 Oct 2006, revised on 26 Feb 2007) ________________________________________________________________________...

متن کامل

A Novel Particle Swarm Optimization Algorithm for Global Optimization

Particle Swarm Optimization (PSO) is a recently developed optimization method, which has attracted interest of researchers in various areas due to its simplicity and effectiveness, and many variants have been proposed. In this paper, a novel Particle Swarm Optimization algorithm is presented, in which the information of the best neighbor of each particle and the best particle of the entire popu...

متن کامل

Particle Swarm Optimization with Reduction for Global Optimization Problems

This paper presents an algorithm of particle swarm optimization with reduction for global optimization problems. Particle swarm optimization is an algorithm which refers to the collective motion such as birds or fishes, and a multi-point search algorithm which finds a best solution using multiple particles. Particle swarm optimization is so flexible that it can adapt to a number of optimization...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2022

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math10071032